A catalog of steiner tree formulations

نویسندگان

  • Michel X. Goemans
  • Young-Soo Myung
چکیده

We present some existing and some new formulations for the Steiner tree and Steiner arborescence problems. We show the equivalence of many of these formulations. In particular, we establish the equivalence between the classical bidirected dicut relaxation and two vertex weighted undirected relaxations. The motivation behind this study is a characterization of the feasible region of the dicut relaxation in the natural space corresponding to the Steiner tree problem. *Supported by Air Force contract AFOSR-89-0271 and DARPA contract DARPA-89-5-1988. tOn leave at the Operations Research Center, MIT. Partial Support from the Yonam Foundation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ILP formulations for the two-stage stochastic Steiner tree problem

We give an overview of new and existing cutand flow-based ILP formulations for the two-stage stochastic Steiner tree problem and compare the strength of the LP relaxations.

متن کامل

A catalog of Hanan grid problems

We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including | but not limited to | Steiner trees for rectilinear (or iso-thetic) polygons, obstacle-avoiding Steiner trees, gro...

متن کامل

Solving a tri-objective convergent product network using the Steiner tree

Considering convergent product as an important manufacturing technology for digital products, we integrate functions and sub-functions using a comprehensive fuzzy mathematical optimization process. To form the convergent product, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link betwe...

متن کامل

Statistical Alignment via k-Restricted Steiner Trees

When relating a set of sequences by a phylogeny, we are essentially constructing a Steiner tree connecting the sequences in the space of all finite sequences. Finding an optimal Steiner tree is in most formulations hard, so population genetics and phylogenetics have often used spanning trees as an approximation for computational expediency. In this assessment you will be asked to investigate an...

متن کامل

Strong formulations for network design problems with connectivity requirements

The network design problem with connectivity requirements (NDC) models a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design problems. We develop strong formulations for two versions of the edge-connectivity NDC problem: unitary problems requiring connected network designs, and nonunitary problems permit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Networks

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1993